28 research outputs found

    Weighted Compensative Logic With Adjustable Threshold Andness and Orness

    No full text

    Evolution and evaluation of SPEC benchmarks

    No full text

    Evaluation And Design Of Benchmark Suites

    No full text
    INTRODUCTION Benchmark suites are most frequently designed for industrial evaluation of competitive computer systems and networks. Examples of such benchmark suites include SPEC, TPC, GPC, PERFECT Club Benchmarks, AIM benchmarks, and others. In addition to benchmark suites sponsored by consortia of computer industry there are various collections of benchmarks designed by research organizations, companies, computer magazines, and individuals for benchmarking specific hardware and software systems. Examples of such benchmark suites include database benchmarks 6 , supercomputer benchmarks (Livermore loops 7 , NAS Parallel Benchmarks 8 , Lisp benchmarks 9 , Prolog benchmarks 10 , and many others 11 . In the majority of cases benchmark workloads are selected from a specif

    Continuous Preference Logic for System Evaluation

    No full text

    Generalized Conjunction/Disjunction

    Get PDF
    AbstractThe generalized conjunction/disjunction function (GCD) is a continuous logic function of two or more variables that integrates conjunctive and disjunctive properties in a single function. It is used as a mathematical model of simultaneity and replaceability of inputs. Special cases of this function include the full (pure) conjunction, the partial conjunction, the arithmetic mean, the partial disjunction, and the full (pure) disjunction. GCD enables a continuous transition from the full conjunction to the full disjunction, using a parameter that specifies a desired level of conjunction (andness) or disjunction (orness). In this paper, we investigate and compare various versions of GCD and other mathematical models of simultaneity and replaceability that are applicable in the areas of system evaluation, and information retrieval

    Multicriteria methods and logic aggregation in suitability maps

    No full text
    In this paper, we identify and describe fundamental logic properties of multicriteria methods for land-use suitability analysis and the design of suitability maps. The existing multicriteria methods can be evaluated from the standpoint of their ability to support the necessary logic properties that affect the expressive power of evaluation methods. The paper investigates and compares simple additive scoring, multiattribute value technique, multiattribute utility technique, analytic hierarchy process, ordered weighted average, outranking methods, and logic scoring of preference (LSP). We introduce canonical forms of logic aggregation in suitability maps and show how to use canonical aggregation structures to design LSP suitability maps tha

    Dealing with data veracity in multiple criteria handling : an LSP-based sibling approach

    No full text
    In a big data context, data often originate from various unreliable sources and cannot be considered perfect. Data veracity denotes the overall confidence we have in the data and clearly has an impact on the results of querying and decision making processes. In this paper, we study the impact of data veracity on criterion handling and propose a novel, LSP-based sibling evaluation approach that explicitly copes with data veracity. Logic Scoring of Preference (LSP) is a computational intelligence method that is based on logic criteria selection, evaluation and aggregation. In our proposal, LSP techniques are independently used for scoring preferences on data and preferences on data confidence. This results for each preference on data in an elementary sibling pair, consisting of a satisfaction score and its associated confidence score. Sibling pairs are aggregated using a novel sibling aggregation structure. The resulting sibling pairs, being indicators of both suitability and confidence, provide better interpretable and explainable evaluation results
    corecore